Crawling the Algorithmic Foundations of Recommendation Technologies
نویسنده
چکیده
The World-Wide-Web has emerged during the last decade as one of the most prominent research fields. However, its size, heterogeneity and complexity to a large extent overcome our ability to efficiently manipulate data using traditional techniques. In order to cope with these characteristics several Web applications require intelligent tools that may help to extract the proper information relevant to the user’s requests. In this thesis we report on the algorithmic aspects of recommendation technologies, which refer to algorithms and systems that have been developed to help users find items that may be of their interest from a variety of available items. Collaborative Filtering (CF), the prevalent method for providing recommendations, has been successfully adopted by research and industrial applications. However, its applicability is limited due to the sparsity and the scalability problems. Sparsity refers to a situation that transactional data are lacking or are insufficient, while scalability refers to the expensive computations required by CF. For addressing the scalability problem we propose a method of Incremental CF (ICF) that is based on incremental updates of user-to-user similarities. Our ICF algorithm (i) is not based on any approximation method, thus it gives the potential for high-quality recommendations formulation, and (ii) provides recommendations orders of magnitude faster than classic CF and thus, is suitable for online application. To provide high-quality recommendations even when data are sparse, we propose a method for alleviating sparsity using trust inferences. Trust inferences are transitive associations between users in the context of an underlying social network and are valuable sources of additional information that help dealing with the sparsity and the cold-start problems. Our experimental evaluation indicates that our method of trust inferences significantly improves the quality performance of the classic CF method. Finally, we provide a roadmap for future research directions that extend recommendation technologies to more complex types of applications and identify various research opportunities for developing them. Supervisor: Dimitris Plexousakis Associate Professor
منابع مشابه
Higher-Order Stability Analysis of Imperfect Laminated Piezo-Composite Plates on Elastic Foundations Under Electro-Thermo-Mechanical Loads
This article provides a fully analytical approach for nonlinear equilibrium path of rectangular sandwich plates. The core of structure is made of symmetric cross-ply laminated composite and the outer surfaces are piezoelectric actuators which perfectly bonded to inner core. The structure is subjected to electro-thermo-mechanical loads simultaneously. One side of plate is rested on Pasternak typ...
متن کاملPrioritize the ordering of URL queue in Focused crawler
The enormous growth of the World Wide Web in recent years has made it necessary to perform resource discovery efficiently. For a crawler it is not an simple task to download the domain specific web pages. This unfocused approach often shows undesired results. Therefore, several new ideas have been proposed, among them a key technique is focused crawling which is able to crawl particular topical...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملA Distributed Trust-based Recommendation System on Social Networks
In everyday life, we seek suggestions from people we know for deciding the best place to buy a particular good or service. In this work, we put forth a framework of an automated distributed recommendation system on a social network that exploits the widely studied concept of trust, to get personalized responses. The main contribution of our model is to combine two forms in which trust is percei...
متن کاملProbabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005